153. Find Minimum in Rotated Sorted Array - LeetCode Solution

class Solution:
    def findMin(self, nums: List[int]) -> int:
        
        if len(nums) == 0:
            return -1
        
        if len(nums) == 1:
            return nums[0]
        
        
        
        start = 0
        end = len(nums) -1


        while start < end:
            mid = (start + end) //2


            if mid > 0 and nums[mid] < nums[mid-1]:
                return nums[mid]
                break

            elif nums[start] <= nums[mid] and nums[mid] > nums[end]:
                start = mid +1
            else:
                end = mid -1



        return nums[start]